Search results for "Bézier curve"
showing 10 items of 31 documents
Parametric Hull Design with Rational Bézier Curves
2021
AbstractIn this paper, a tool able to support the sailing yacht designer during the early stage of the design process has been developed. Quadratic and cubic Rational Bézier curves have been selected to describe the main curves defining the hull of a sailing yacht. The adopted approach is based upon the definition of a set of parameters, say the length of water line, the beam of the waterline, canoe body draft and some dimensionless coefficients according to the traditional way of the yacht designer. Some geometrical constraints imposed on the curves (e.g. continuity, endpoint angles) have been conceived aimed to avoid unreasonable shapes. These curves can be imported in any commercial CAD …
Real-time clothoid approximation by Rational Bezier curves
2008
This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant comput…
A COMPARATIVE STUDY BETWEEN ´ BIHARMONIC BEZIER SURFACES AND BIHARMONIC EXTREMAL SURFACES
2009
AbstractGiven a prescribed boundary of a Bezier surface, we compare the Bezier surfaces generated by two different methods, i.e., the Bezier surface minimising the biharmonic functional and the unique Bezier surface solution of the biharmonic equation with prescribed boundary. Although often the two types of surfaces look visually the same, we show that they are indeed different. In this paper, we provide a theoretical argument showing why the two types of surfaces are not always the same.
Conversion d'un carreau de Bézier rationnel biquadratique en un carreau de cyclide de Dupin quartique
2006
Dupin cyclides were introduced in 1822 by the French mathematician C-P. Dupin. They are algebraic surfaces of degree 3 or 4. The set of geometric properties of these surfaces has encouraged an increasing interest in using them for geometric modeling. A couple of algorithmes is already developed to convert a Dupin cyclide patch into a rational biquadratic Bezier patch. In this paper, we consider the inverse problem: we investigate the conditions of convertibility of a Bezier patch into a Dupin cyclide one, and we present a conversion algorithm to compute the parameters of a Dupin cyclide with the boundary of the patch that corresponds to the given Bezier patch.
Bézier surfaces of minimal area: The Dirichlet approach
2004
The Plateau-Bezier problem consists in finding the Bezier surface with minimal area from among all Bezier surfaces with prescribed border. An approximation to the solution of the Plateau-Bezier problem is obtained by replacing the area functional with the Dirichlet functional. Some comparisons between Dirichlet extremals and Bezier surfaces obtained by the use of masks related with minimal surfaces are studied.
A Geometric Algorithm for Ray/Bézier Surfaces Intersection Using Quasi-Interpolating Control Net
2008
In this paper, we present a new geometric algorithm to compute the intersection between a ray and a rectangular Bezier patch. The novelty of our approach resides in the use of bounds of the difference between a Bezier patch and its quasi-interpolating control net. The quasi-interpolating polygon of a Bezier surface of arbitrary degree approximates the limit surface within a precision that is function of the second order difference of the control points, which allows for very simple projections and 2D intersection tests to determine sub-patches containing a potential intersection. Our algorithm is simple, because it only determines a 2D parametric interval containing the solution, and effici…
Explicit Bézier control net of a PDE surface
2017
The PDE under study here is a general fourth-order linear elliptic Partial Differential Equation. Having prescribed the boundary control points, we provide the explicit expression of the whole control net of the associated PDE Bézier surface. In other words, we obtain the explicit expressions of the interior control points as linear combinations of free boundary control points. The set of scalar coefficients of these combinations works like a mould for PDE surfaces. Thus, once this mould has been computed for a given degree, real-time manipulation of the resulting surfaces becomes possible by modifying the prescribed information. The work was partially supported by Spanish Ministry of Econo…
Construction of 3D Triangles on Dupin Cyclides
2011
This paper considers the conversion of the parametric Bézier surfaces, classically used in CAD-CAM, into patched of a class of non-spherical degree 4 algebraic surfaces called Dupin cyclides, and the definition of 3D triangle with circular edges on Dupin cyclides. Dupin cyclides was discovered by the French mathematician Pierre-Charles Dupin at the beginning of the 19th century. A Dupin cyclide has one parametric equation, two implicit equations, and a set of circular lines of curvature. The authors use the properties of these surfaces to prove that three families of circles (meridian arcs, parallel arcs, and Villarceau circles) can be computed on every Dupin cyclide. A geometric algorithm …
Triangular Bézier Surfaces of Minimal Area
2003
We study some methods of obtaining approximations to surfaces of minimal area with prescribed border using triangular Bezier patches. Some methods deduced from a variational principle are proposed and compared with some masks.
Representation of NURBS surfaces by Controlled Iterated Functions System automata
2019
Iterated Function Systems (IFS) are a standard tool to generate fractal shapes. In a more general way, they can represent most of standard surfaces like Bézier or B-Spline surfaces known as self-similar surfaces. Controlled Iterated Function Systems (CIFS) are an extension of IFS based on automata. CIFS are basically multi-states IFS, they can handle all IFS shapes but can also manage multi self-similar shapes. For example CIFS can describe subdivision surfaces around extraordinary vertices whereas IFS cannot. Having a common CIFS formalism facilitates the development of generic methods to manage interactions (junctions, differences...) between objects of different natures.This work focuses…